home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Language/OS - Multiplatform Resource Library
/
LANGUAGE OS.iso
/
lisp
/
eulisp
/
feel-075.lha
/
feel0.75
/
Src
/
y.tab.c
< prev
next >
Wrap
C/C++ Source or Header
|
1992-06-18
|
31KB
|
1,170 lines
/* A Bison parser, made from parser.yac */
#define IDENTIFIER 258
#define TINTEGER 259
#define TRATIONAL 260
#define TFLOAT 261
#define TCHAR 262
#define TSTRING 263
#define QUOTATION 264
#define UNQUOTATION 265
#define UNQUOTE_SPLICE 266
#define ANTI_QUOTATION 267
#define EXTENSION 268
#define PAIR_BEGIN 269
#define PAIR_END 270
#define DOT 271
#define END_OF_STREAM 272
#line 1 "parser.yac"
/* $Id: y.tab.c,v 1.4 1992/02/10 12:00:22 pab Exp $ */
/* $Log: y.tab.c,v $
* Revision 1.4 1992/02/10 12:00:22 pab
* Fixed reader errors
*
* Revision 1.3 1992/01/29 20:11:18 pab
* fixed for K&R C
*
* Revision 1.2 1991/09/11 12:07:54 pab
* 11/9/91 First Alpha release of modified system
*
Revision 1.5 1991/03/01 17:28:00 sm
ANSI prototypes inside ifdef __STDC__ s since y.tab.c to complicated for
ANSI filter
Revision 1.4 1991/03/01 16:32:28 is
Modified read with line numbers I guess.
(kjp)
Revision 1.3 1991/02/13 19:53:58 kjp
New error handling on parse errors.
Revision 1.2 1991/02/11 18:01:44 is
Added support for read-with-line-numbers
*/
#define YYDEBUG 0
int yydebug=0;
#include <stdio.h>
#include "funcalls.h"
#include "defs.h"
#include "structs.h"
#include "global.h"
#include "symboot.h"
#include "vectors.h"
#include "error.h"
#include "lex_global.h"
LispObject auxx;
LispObject my_yy_val;
int with_line_numbers;
extern int lex_input_line_number;
LispObject line_number_table;
extern pptoken pptok;
#ifdef __STDC__
void yyerror(LispObject *,char *);
#else
void yyerror();
#endif
#line 53 "parser.yac"
typedef union{
LispObject lspobj;
} YYSTYPE;
#ifndef YYLTYPE
typedef
struct yyltype
{
int timestamp;
int first_line;
int first_column;
int last_line;
int last_column;
char *text;
}
yyltype;
#define YYLTYPE yyltype
#endif
#ifndef YYDEBUG
#define YYDEBUG 1
#endif
#include <stdio.h>
#ifndef __STDC__
#define const
#endif
#define YYFINAL 58
#define YYFLAG -32768
#define YYNTBASE 18
#define YYTRANSLATE(x) ((unsigned)(x) <= 272 ? yytranslate[x] : 34)
static const char yytranslate[] = { 0,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 1, 2, 3, 4, 5,
6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
16, 17
};
static const short yyprhs[] = { 0,
0, 2, 4, 6, 8, 10, 12, 14, 16, 18,
20, 22, 24, 26, 28, 30, 32, 34, 36, 38,
40, 42, 44, 46, 48, 49, 53, 58, 62, 64,
68, 71, 75, 76, 78, 81, 84, 86, 88, 90,
92, 96, 99
};
static const short yyrhs[] = { 19,
0, 17, 0, 21, 0, 23, 0, 22, 0, 23,
0, 4, 0, 5, 0, 6, 0, 7, 0, 8,
0, 3, 0, 16, 0, 15, 0, 4, 0, 5,
0, 6, 0, 7, 0, 8, 0, 3, 0, 24,
0, 33, 0, 26, 0, 30, 0, 0, 14, 25,
15, 0, 14, 25, 20, 27, 0, 14, 1, 15,
0, 15, 0, 16, 20, 15, 0, 20, 27, 0,
16, 1, 15, 0, 0, 29, 0, 20, 28, 0,
31, 19, 0, 9, 0, 10, 0, 11, 0, 12,
0, 14, 28, 15, 0, 13, 32, 0, 13, 1,
15, 0
};
#if YYDEBUG != 0
static const short yyrline[] = { 0,
67, 68, 71, 72, 75, 76, 79, 80, 81, 82,
83, 85, 87, 88, 92, 93, 94, 95, 96, 98,
102, 103, 106, 107, 110, 113, 114, 118, 121, 122,
123, 124, 127, 128, 131, 134, 137, 138, 139, 140,
143, 145, 147
};
static const char * const yytname[] = { "$",
"error","$illegal.","IDENTIFIER","TINTEGER","TRATIONAL","TFLOAT","TCHAR","TSTRING","QUOTATION","UNQUOTATION",
"UNQUOTE_SPLICE","ANTI_QUOTATION","EXTENSION","PAIR_BEGIN","PAIR_END","DOT","END_OF_STREAM","top_data","data_top","inner_data",
"top_simple","inner_simple","compound","list","line_number","list_or_pair","more_data","inner_data_star","inner_data_plus","abbreviation",
"prefix","simple_list","vector",""
};
#endif
static const short yyr1[] = { 0,
18, 18, 19, 19, 20, 20, 21, 21, 21, 21,
21, 21, 21, 21, 22, 22, 22, 22, 22, 22,
23, 23, 24, 24, 25, 26, 26, 26, 27, 27,
27, 27, 28, 28, 29, 30, 31, 31, 31, 31,
32, 33, 33
};
static const short yyr2[] = { 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 0, 3, 4, 3, 1, 3,
2, 3, 0, 1, 2, 2, 1, 1, 1, 1,
3, 2, 3
};
static const short yydefact[] = { 0,
12, 7, 8, 9, 10, 11, 37, 38, 39, 40,
0, 0, 14, 13, 2, 1, 3, 4, 21, 23,
24, 0, 22, 0, 33, 42, 0, 0, 36, 43,
20, 15, 16, 17, 18, 19, 33, 5, 6, 0,
34, 28, 26, 0, 35, 41, 29, 0, 0, 27,
0, 0, 31, 32, 30, 0, 0, 0
};
static const short yydefgoto[] = { 56,
16, 37, 17, 38, 39, 19, 28, 20, 50, 40,
41, 21, 22, 26, 23
};
static const short yypact[] = { 1,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
68, 24,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768, 37,-32768, -14, 93,-32768, -13, 80,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768, 93,-32768,-32768, 5,
-32768,-32768,-32768, 51,-32768,-32768,-32768, 67, 51,-32768,
6, 11,-32768,-32768,-32768, 108, 109,-32768
};
static const short yypgoto[] = {-32768,
88, -25,-32768,-32768, 0,-32768,-32768,-32768, 62, 75,
-32768,-32768,-32768,-32768,-32768
};
#define YYLAST 112
static const short yytable[] = { 18,
30, 42, 44, 1, 2, 3, 4, 5, 6, 7,
8, 9, 10, 11, 12, 13, 14, 15, 49, 46,
54, 18, 52, 49, 27, 55, -25, -25, -25, -25,
-25, -25, -25, -25, -25, -25, -25, -25, -25, 1,
2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
12, 13, 14, 31, 32, 33, 34, 35, 36, 7,
8, 9, 10, 11, 12, 47, 48, 51, 24, 31,
32, 33, 34, 35, 36, 7, 8, 9, 10, 11,
12, 25, 31, 32, 33, 34, 35, 36, 7, 8,
9, 10, 11, 12, 43, 31, 32, 33, 34, 35,
36, 7, 8, 9, 10, 11, 12, 57, 58, 29,
53, 45
};
static const short yycheck[] = { 0,
15, 15, 28, 3, 4, 5, 6, 7, 8, 9,
10, 11, 12, 13, 14, 15, 16, 17, 44, 15,
15, 22, 48, 49, 1, 15, 3, 4, 5, 6,
7, 8, 9, 10, 11, 12, 13, 14, 15, 3,
4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
14, 15, 16, 3, 4, 5, 6, 7, 8, 9,
10, 11, 12, 13, 14, 15, 16, 1, 1, 3,
4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
14, 14, 3, 4, 5, 6, 7, 8, 9, 10,
11, 12, 13, 14, 15, 3, 4, 5, 6, 7,
8, 9, 10, 11, 12, 13, 14, 0, 0, 22,
49, 37
};
/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
#line 3 "bison.simple"
/* Skeleton output parser for bison,
Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 1, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#ifndef alloca
#ifdef __GNUC__
#define alloca __builtin_alloca
#else /* Not GNU C. */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__)
#include <alloca.h>
#else /* Not sparc */
#ifdef MSDOS
#include <malloc.h>
#endif /* MSDOS */
#endif /* Not sparc. */
#endif /* Not GNU C. */
#endif /* alloca not defined. */
/* This is the parser code that is written into each bison parser
when the %semantic_parser declaration is not specified in the grammar.
It was written by Richard Stallman by simplifying the hairy parser
used when %semantic_parser is specified. */
/* Note: there must be only one dollar sign in this file.
It is replaced by the list of actions, each action
as one case of the switch. */
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY -2
#define YYEOF 0
#define YYACCEPT return(0)
#define YYABORT return(1)
#define YYERROR goto yyerrlab1
/* Like YYERROR except do call yyerror.
This remains here temporarily to ease the
transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. */
#define YYFAIL goto yyerrlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(token, value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ yychar = (token), yylval = (value); \
yychar1 = YYTRANSLATE (yychar); \
YYPOPSTACK; \
goto yybackup; \
} \
else \
{ yyerror ("syntax error: cannot back up"); YYERROR; } \
while (0)
#define YYTERROR 1
#define YYERRCODE 256
#ifndef YYPURE
#define YYLEX yylex(stacktop)
#endif
#ifdef YYPURE
#ifdef YYLSP_NEEDED
#define YYLEX yylex(stacktop,&yylval, &yylloc)
#else
#define YYLEX yylex(stacktop,&yylval)
#endif
#endif
/* If nonreentrant, generate the variables here */
#ifndef YYPURE
int yychar; /* the lookahead symbol */
YYSTYPE yylval; /* the semantic value of the */
/* lookahead symbol */
#ifdef YYLSP_NEEDED
YYLTYPE yylloc; /* location data for the lookahead */
/* symbol */
#endif
int yynerrs; /* number of parse errors so far */
#endif /* not YYPURE */
#if YYDEBUG != 0
int yydebug; /* nonzero means print parse trace */
/* Since this is uninitialized, it does not stop multiple parsers
from coexisting. */
#endif
/* YYINITDEPTH indicates the initial size of the parser's stacks */
#ifndef YYINITDEPTH
#define YYINITDEPTH 200
#endif
/* YYMAXDEPTH is the maximum size the stacks can grow to
(effective only if the built-in stack extension method is used). */
#if YYMAXDEPTH == 0
#undef YYMAXDEPTH
#endif
#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
#endif
#ifndef __cplusplus
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
__yy_bcopy (from, to, count)
char *from;
char *to;
int count;
{
register char *f = from;
register char *t = to;
register int i = count;
while (i-- > 0)
*t++ = *f++;
}
#else /* __cplusplus */
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
__yy_bcopy (char *from, char *to, int count)
{
register char *f = from;
register char *t = to;
register int i = count;
while (i-- > 0)
*t++ = *f++;
}
#endif
#line 160 "bison.simple"
#ifdef __STDC__
int
yyparse(LispObject *stacktop)
#else
int yyparse(stacktop)
LispObject *stacktop;
#endif
{
register int yystate;
register int yyn;
register short *yyssp;
register YYSTYPE *yyvsp;
int yyerrstatus; /* number of tokens to shift before error messages enabled */
int yychar1; /* lookahead token as an internal (translated) token number */
short yyssa[YYINITDEPTH]; /* the state stack */
YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
short *yyss = yyssa; /* refer to the stacks thru separate pointers */
YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
#ifdef YYLSP_NEEDED
YYLTYPE *yyls = yylsa;
YYLTYPE *yylsp;
YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
#define YYPOPSTACK (yyvsp--, yysp--, yylsp--)
#else
#define YYPOPSTACK (yyvsp--, yysp--)
#endif
int yystacksize = YYINITDEPTH;
#ifdef YYPURE
int yychar;
YYSTYPE yylval;
int yynerrs;
#ifdef YYLSP_NEEDED
YYLTYPE yylloc;
#endif
#endif
YYSTYPE yyval; /* the variable used to return */
/* semantic values from the action */
/* routines */
int yylen;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Starting parse\n");
#endif
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
/* Initialize stack pointers.
Waste one element of value and location stack
so that they stay on the same level as the state stack. */
yyssp = yyss - 1;
yyvsp = yyvs;
#ifdef YYLSP_NEEDED
yylsp = yyls;
#endif
/* Push a new state, which is found in yystate . */
/* In all cases, when you get here, the value and location stacks
have just been pushed. so pushing a state here evens the stacks. */
yynewstate:
*++yyssp = yystate;
if (yyssp >= yyss + yystacksize - 1)
{
/* Give user a chance to reallocate the stack */
/* Use copies of these so that the &'s don't force the real ones into memory. */
YYSTYPE *yyvs1 = yyvs;
short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
YYLTYPE *yyls1 = yyls;
#endif
/* Get the current used size of the three stacks, in elements. */
int size = yyssp - yyss + 1;
#ifdef yyoverflow
/* Each stack pointer address is followed by the size of
the data in use in that stack, in bytes. */
yyoverflow("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
#ifdef YYLSP_NEEDED
&yyls1, size * sizeof (*yylsp),
#endif
&yystacksize);
yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
yyls = yyls1;
#endif
#else /* no yyoverflow */
/* Extend the stack our own way. */
if (yystacksize >= YYMAXDEPTH)
{
yyerror(stacktop,"parser stack overflow");
return 2;
}
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
yystacksize = YYMAXDEPTH;
yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
__yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
__yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
__yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
#endif
#endif /* no yyoverflow */
yyssp = yyss + size - 1;
yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
yylsp = yyls + size - 1;
#endif
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif
if (yyssp >= yyss + yystacksize - 1)
YYABORT;
}
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Entering state %d\n", yystate);
#endif
yybackup:
/* Do appropriate processing given the current state. */
/* Read a lookahead token if we need one and don't already have one. */
/* yyresume: */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* yychar is either YYEMPTY or YYEOF
or a valid token in external form. */
if (yychar == YYEMPTY)
{
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Reading a token: ");
#endif
yychar = YYLEX;
}
/* Convert token to internal form (in yychar1) for indexing tables with */
if (yychar <= 0) /* This means end of input. */
{
yychar1 = 0;
yychar = YYEOF; /* Don't call YYLEX any more */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Now at end of input.\n");
#endif
}
else
{
yychar1 = YYTRANSLATE(yychar);
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Next token is %d (%s)\n", yychar, yytname[yychar1]);
#endif
}
yyn += yychar1;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
goto yydefault;
yyn = yytable[yyn];
/* yyn is what to do for this token type in this state.
Negative => reduce, -yyn is rule number.
Positive => shift, yyn is new state.
New state is final state => don't bother to shift,
just return success.
0, or most negative number => error. */
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrlab;
if (yyn == YYFINAL)
YYACCEPT;
/* Shift the lookahead token. */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif
/* Discard the token being shifted unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
/* count tokens shifted since error; after three, turn off error status. */
if (yyerrstatus) yyerrstatus--;
yystate = yyn;
goto yynewstate;
/* Do the default action for the current state. */
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
/* Do a reduction. yyn is the number of a rule to reduce with. */
yyreduce:
yylen = yyr2[yyn];
yyval = yyvsp[1-yylen]; /* implement default value of the action */
#if YYDEBUG != 0
if (yydebug)
{
int i;
fprintf (stderr, "Reducing via rule %d (line %d), ",
yyn, yyrline[yyn]);
/* Print the symboles being reduced, and their result. */
for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
fprintf (stderr, "%s ", yytname[yyrhs[i]]);
fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
switch (yyn) {
case 1:
#line 67 "parser.yac"
{ my_yy_val = yyvsp[0].lspobj; YYACCEPT; ;
break;}
case 2:
#line 68 "parser.yac"
{ my_yy_val = q_eof; yyval.lspobj=q_eof; YYACCEPT; ;
break;}
case 3:
#line 71 "parser.yac"
{ yyval.lspobj=yyvsp[0].lspobj; ;
break;}
case 4:
#line 72 "parser.yac"
{ yyval.lspobj=yyvsp[0].lspobj; ;
break;}
case 5:
#line 75 "parser.yac"
{ yyval.lspobj=yyvsp[0].lspobj; ;
break;}
case 6:
#line 76 "parser.yac"
{ yyval.lspobj=yyvsp[0].lspobj; ;
break;}
case 7:
#line 79 "parser.yac"
{ yyval.lspobj=allocate_integer(stacktop,pptok.int_val);;
break;}
case 8:
#line 80 "parser.yac"
{ yyval.lspobj=allocate_ratio(stacktop,(LispObject)allocate_integer(stacktop,pptok.int_val),(LispObject)allocate_integer(stacktop,pptok.rat_den_val));;
break;}
case 9:
#line 81 "parser.yac"
{ yyval.lspobj=allocate_float(stacktop,pptok.float_val); ;
break;}
case 10:
#line 82 "parser.yac"
{ yyval.lspobj=allocate_char(stacktop,pptok.char_val); ;
break;}
case 11:
#line 83 "parser.yac"
{ yyval.lspobj=pptok.string_val;
;
break;}
case 12:
#line 85 "parser.yac"
{ yyval.lspobj=get_symbol_by_copying(stacktop,pptok.sym_val);
;
break;}
case 13:
#line 87 "parser.yac"
{ Reader_CallError(stacktop,"Misplaced dot ignored\n",nil,NONCONTINUABLE); ;
break;}
case 14:
#line 89 "parser.yac"
{ Reader_CallError(stacktop,"Spurious closing parenthesis ignored\n",nil,NONCONTINUABLE); ;
break;}
case 15:
#line 92 "parser.yac"
{ yyval.lspobj=allocate_integer(stacktop,pptok.int_val); ;
break;}
case 16:
#line 93 "parser.yac"
{ yyval.lspobj=allocate_ratio(stacktop,(LispObject)allocate_integer(stacktop,pptok.int_val),(LispObject)allocate_integer(stacktop,pptok.rat_den_val));;
break;}
case 17:
#line 94 "parser.yac"
{ yyval.lspobj=allocate_float(stacktop,pptok.float_val); ;
break;}
case 18:
#line 95 "parser.yac"
{ yyval.lspobj=allocate_char(stacktop,pptok.char_val); ;
break;}
case 19:
#line 96 "parser.yac"
{ yyval.lspobj=pptok.string_val;
;
break;}
case 20:
#line 98 "parser.yac"
{ yyval.lspobj=get_symbol_by_copying(stacktop,pptok.sym_val);
;
break;}
case 21:
#line 102 "parser.yac"
{ yyval.lspobj=yyvsp[0].lspobj; ;
break;}
case 22:
#line 103 "parser.yac"
{ yyval.lspobj=yyvsp[0].lspobj; ;
break;}
case 23:
#line 106 "parser.yac"
{ yyval.lspobj=yyvsp[0].lspobj; ;
break;}
case 24:
#line 107 "parser.yac"
{ yyval.lspobj=yyvsp[0].lspobj; ;
break;}
case 25:
#line 110 "parser.yac"
{/* line_number is just a place holder */
yyval.lspobj = allocate_integer(stacktop,lex_input_line_number) ; ;
break;}
case 26:
#line 113 "parser.yac"
{ yyval.lspobj=nil; ;
break;}
case 27:
#line 115 "parser.yac"
{ if (with_line_numbers) {
yyval.lspobj=EUCALL_2(Fn_cons,yyvsp[-1].lspobj,yyvsp[0].lspobj);
EUCALL_3(tref_updator,line_number_table,yyval.lspobj,yyvsp[-2].lspobj);}
else yyval.lspobj=EUCALL_2(Fn_cons,yyvsp[-1].lspobj,yyvsp[0].lspobj);;
break;}
case 28:
#line 118 "parser.yac"
{Reader_CallError(stacktop,"Error building list or dotted pair\n",nil,NONCONTINUABLE);;
break;}
case 29:
#line 121 "parser.yac"
{ yyval.lspobj=nil; ;
break;}
case 30:
#line 122 "parser.yac"
{ yyval.lspobj=yyvsp[-1].lspobj; ;
break;}
case 31:
#line 123 "parser.yac"
{ EUCALLSET_2(yyval.lspobj,Fn_cons,yyvsp[-1].lspobj,yyvsp[0].lspobj);;
break;}
case 32:
#line 124 "parser.yac"
{ Reader_CallError(stacktop,"Error building dotted pair\n",nil,NONCONTINUABLE);;
break;}
case 33:
#line 127 "parser.yac"
{ yyval.lspobj=nil; ;
break;}
case 34:
#line 128 "parser.yac"
{ yyval.lspobj=yyvsp[0].lspobj; ;
break;}
case 35:
#line 131 "parser.yac"
{ EUCALLSET_2(yyval.lspobj,Fn_cons,yyvsp[-1].lspobj,yyvsp[0].lspobj); ;
break;}
case 36:
#line 134 "parser.yac"
{ LispObject xx;
xx = EUCALL_2(Fn_cons,yyvsp[0].lspobj,nil);
yyval.lspobj=EUCALL_2(Fn_cons,yyvsp[-1].lspobj,xx); ;
break;}
case 37:
#line 137 "parser.yac"
{ yyval.lspobj=sym_quote; ;
break;}
case 38:
#line 138 "parser.yac"
{ yyval.lspobj=sym_unquote; ;
break;}
case 39:
#line 139 "parser.yac"
{ yyval.lspobj=get_symbol(stacktop,"unquote-splicing"); ;
break;}
case 40:
#line 140 "parser.yac"
{ yyval.lspobj=get_symbol(stacktop,"quasiquote"); ;
break;}
case 41:
#line 143 "parser.yac"
{ yyval.lspobj=yyvsp[-1].lspobj; ;
break;}
case 42:
#line 146 "parser.yac"
{ EUCALLSET_1(yyval.lspobj,Fn_vector,yyvsp[0].lspobj); ;
break;}
case 43:
#line 148 "parser.yac"
{
Reader_CallError(stacktop,"Error building vector\n",nil,NONCONTINUABLE); ;
break;}
}
/* the action file gets copied in in place of this dollarsign */
#line 423 "bison.simple"
yyvsp -= yylen;
yyssp -= yylen;
#ifdef YYLSP_NEEDED
yylsp -= yylen;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
*++yyvsp = yyval;
#ifdef YYLSP_NEEDED
yylsp++;
if (yylen == 0)
{
yylsp->first_line = yylloc.first_line;
yylsp->first_column = yylloc.first_column;
yylsp->last_line = (yylsp-1)->last_line;
yylsp->last_column = (yylsp-1)->last_column;
yylsp->text = 0;
}
else
{
yylsp->last_line = (yylsp+yylen-1)->last_line;
yylsp->last_column = (yylsp+yylen-1)->last_column;
}
#endif
/* Now "shift" the result of the reduction.
Determine what state that goes to,
based on the state we popped back to
and the rule number reduced by. */
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTBASE];
goto yynewstate;
yyerrlab: /* here on detecting error */
if (! yyerrstatus)
/* If not already recovering from an error, report this error. */
{
++yynerrs;
#ifdef YYERROR_VERBOSE
yyn = yypact[yystate];
if (yyn > YYFLAG && yyn < YYLAST)
{
int size = 0;
char *msg;
int x, count;
count = 0;
for (x = 0; x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
size += strlen(yytname[x]) + 15, count++;
msg = (char *) xmalloc(size + 15);
strcpy(msg, "parse error");
if (count < 5)
{
count = 0;
for (x = 0; x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
{
strcat(msg, count == 0 ? ", expecting `" : " or `");
strcat(msg, yytname[x]);
strcat(msg, "'");
count++;
}
}
yyerror(stacktop,msg);
free(msg);
}
else
#endif /* YYERROR_VERBOSE */
yyerror(stacktop,"parse error");
}
yyerrlab1: /* here on error raised explicitly by an action */
if (yyerrstatus == 3)
{
/* if just tried and failed to reuse lookahead token after an error, discard it. */
/* return failure if at end of input */
if (yychar == YYEOF)
YYABORT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif
yychar = YYEMPTY;
}
/* Else will try to reuse lookahead token
after shifting the error token. */
yyerrstatus = 3; /* Each real token shifted decrements this */
goto yyerrhandle;
yyerrdefault: /* current state does not do anything special for the error token. */
#if 0
/* This is wrong; only states that explicitly want error tokens
should shift them. */
yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
if (yyn) goto yydefault;
#endif
yyerrpop: /* pop the current state because it cannot handle the error token */
if (yyssp == yyss) YYABORT;
yyvsp--;
yystate = *--yyssp;
#ifdef YYLSP_NEEDED
yylsp--;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "Error: state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
yyerrhandle:
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yyerrdefault;
yyn += YYTERROR;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
goto yyerrdefault;
yyn = yytable[yyn];
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrpop;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrpop;
if (yyn == YYFINAL)
YYACCEPT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting error token, ");
#endif
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
yystate = yyn;
goto yynewstate;
}
#line 152 "parser.yac"
#ifdef __STDC__
void yyerror(LispObject *stacktop,char *s)
#else
void yyerror(stacktop,s)
LispObject *stacktop;
char *s;
#endif
{
Reader_CallError(stacktop,"System parser error - watch your brackets!",nil,NONCONTINUABLE);
}
#ifdef __STDC__
LispObject Fn_Lex_Yacc_reader(LispObject *stacktop,FILE *fd)
#else
LispObject Fn_Lex_Yacc_reader(stacktop,fd)
LispObject *stacktop;
FILE *fd;
#endif
{
#ifdef WITH_FUDGE
#ifdef __STDC__
extern void yy_set_stream(FILE *);
#else
extern void yy_set_stream();
#endif
#else
extern FILE *yyin;
#endif
int ret;
with_line_numbers=0;
#ifdef WITH_FUDGE
yy_set_stream(fd);
#else
yyin = fd;
#endif
ret = yyparse(stacktop);
if (ret != 0) {
fprintf(stderr,"Something strange...\n"); fflush(stderr);
return(q_eof);
}
else
return((LispObject) (my_yy_val));
}
#ifdef __STDC__
LispObject Fn_Lex_Yacc_reader_linenos(LispObject *stacktop,FILE *fd)
#else
LispObject Fn_Lex_Yacc_reader_linenos(stacktop,fd)
LispObject *stacktop;
FILE *fd;
#endif
{
#ifdef WITH_FUDGE
#ifdef __STDC__
extern void yy_set_stream(FILE *);
#else
extern void yy_set_stream();
#endif
#else
extern FILE *yyin;
#endif
struct table_structure *allocate_tabl();
LispObject Fn_eq();
LispObject Fn_cons();
int ret;
with_line_numbers=1;
#ifdef WITH_FUDGE
yy_set_stream(fd);
#else
yyin = fd;
#endif
line_number_table = (LispObject) allocate_table(stacktop,Fn_eq);
STACK(line_number_table);
ret = yyparse(stacktop);
if (ret != 0) {
fprintf(stderr,"Something strange...\n"); fflush(stderr);
return(q_eof);
}
else {
line_number_table = EUCALL_2(Fn_cons, (LispObject)my_yy_val,line_number_table);
return(line_number_table); /* really the line number table and
the S expression */
}
}